宽体液腔Janus-Helmholtz换能器

本文使用有限元方法对宽体液腔Janus-Helmholtz(JH)换能器进行了仿真分析,得出了壳体宽度拓展增量对JH换能器工作性能的影响规律。使用三维建模的方式,分析了连接部分对换能器性能的影响及宽体壳体的的模态,证明了三维建模的必要性。依据仿真优化结构设计了一款宽体液腔JH换能器并进行了湖上测试。最终测试结果与仿真结果有很好的一致性,相较直筒JH换能器其谐振频率降低300Hz,发射电压响应最高可达144dB。     

干式变压器有限元仿真模型的电磁和振动分析

随着电力需求的逐年增长,干式变压器的数量也在不断增加。干式变压器在运行时存在着振动和噪声的问题,为了对干式变压器振动的规律与特点进行研究,本文建立了干式变压器本体振动的有限元仿真模型,通过电磁分析获得相应的磁场分布,然后利用结构动力学分析得到其本体振动的相关规律。通过对处于运行状态的变压器振动数据进行实测分析,得到变压器振动的特征频率,然后对仿真结果进行对比分析,可以发现振动幅度与频率之间存在的关系。本文的研究结果可对干式变压器的减振降噪研究提供参考。     

Stabilization of a viscoelastic rotating Euler‐Bernoulli beam

In this paper, we consider a rotating Euler‐Bernoulli beam. The beam is made of a viscoelastic material, and it is subject to undesirable vibrations. Under a suitable control torque applied at the motor, we prove the arbitrary stabilization of the system for a large class of relaxation functions by using the multiplier method and some ideas introduced by Tatar (J. Math. Phys. 52:013502, 2011).     

接地式三要素型动力吸振器性能分析

利用固定点理论优化接地类型的动力吸振器得到的结果可能不是全局最优参数,在选择其他参数时主系统可以获得更小的振幅, 接地类型动力吸振器的优化问题值得进一步研究. 因此,以一种接地式三要素型动力吸振器为对象,通过研究系统参数变化对固 定点位置与主系统最大振幅的影响,得到了此吸振器的局部最优参数并分析了它的性能. 首先建立了此系统模型的运动微分方程, 得到了主系统振幅放大因子,发现系统存在3个与阻尼无关的固定点. 固定点中幅值较大点随系统参数变化的趋势可以代表最大振 幅随系统参数变化的趋势,因此利用盛金公式得到了固定点幅值的表达式. 为了更加精确,进一步使用数值算法得到了最大振幅与 系统参数的关系图,发现系统中存在局部最优参数. 通过对比接地式吸振器与接地三要素型吸振器的最大振幅随系统参数变化的趋 势,得到了接地式三要素型吸振器的局部最优参数,并发现当固有频率比小于局部最优频率比时,接地式三要素型吸振器模型主系 统的最大振幅要远小于接地式动力吸振器模型.      

Improving the approximation of the probability density function of random nonautonomous logistic‐type differential equations

In this paper, we address the problem of approximating the probability density function of the following random logistic differential equation: P^′(t,ω)=A(t,ω)(1?P(t,ω))P(t,ω), t∈[t₀,T], P(t₀,ω)=P₀(ω), where ω is any outcome in the sample space Ω. In the recent contribution [Cortés, JC, et al. Commun Nonlinear Sci Numer Simulat 2019; 72: 121–138], the authors imposed conditions on the diffusion coefficient A(t) and on the initial condition P₀ to approximate the density function f₁(p,t) of P(t): A(t) is expressed as a Karhunen–Loève expansion with absolutely continuous random coefficients that have certain growth and are independent of the absolutely continuous random variable P₀, and the density of P₀, , is Lipschitz on (0,1). In this article, we tackle the problem in a different manner, by using probability tools that allow the hypotheses to be less restrictive. We only suppose that A(t) is expanded on L²([t₀,T]×Ω), so that we include other expansions such as random power series. We only require absolute continuity for P₀, so that A(t) may be discrete or singular, due to a modified version of the random variable transformation technique. For , only almost everywhere continuity and boundedness on (0,1) are needed. We construct an approximating sequence of density functions in terms of expectations that tends to f₁(p,t) pointwise. Numerical examples illustrate our theoretical results.     

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs

We show that for every there exists C > 0 such that if then asymptotically almost surely the random graph contains the k^th power of a Hamilton cycle. This determines the threshold for appearance of the square of a Hamilton cycle up to the logarithmic factor, improving a result of Kühn and Osthus. Moreover, our proof provides a randomized quasi‐polynomial algorithm for finding such powers of cycles. Using similar ideas, we also give a randomized quasi‐polynomial algorithm for finding a tight Hamilton cycle in the random k‐uniform hypergraph for . The proofs are based on the absorbing method and follow the strategy of Kühn and Osthus, and Allen et al. The new ingredient is a general Connecting Lemma which allows us to connect tuples of vertices using arbitrary structures at a nearly optimal value of p. Both the Connecting Lemma and its proof, which is based on Janson's inequality and a greedy embedding strategy, might be of independent interest.     

Uniform random colored complexes

We present here random distributions on (D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2p. These graphs encode D‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p→∞. The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p, as p→∞.     

A Tree-valued Markov Process Associated with an Admissible Family of Branching Mechanisms

Let E?R be an interval. By studying an admissible family of branching mechanisms{ψt,t ∈E} introduced in Li [Ann. Probab., 42, 41-79(2014)], we construct a decreasing Levy-CRT-valued process {Tt, t ∈ E} by pruning Lévy trees accordingly such that for each t ∈E, Tt is a ψt-Lévy tree. We also obtain an analogous process {Tt*,t ∈E} by pruning a critical Levy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of {Tt,t ∈E} at the ascension time A := inf{t ∈E;Tt is finite} can be represented by{Tt*,t∈E}.The results generalize those studied in Abraham and Delmas [Ann. Probab., 40, 1167-1211(2012)].     

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

On percolation and ‐hardness

The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest.